Termination Proof Script
Consider the TRS R consisting of the rewrite rules
|
| 1: |
|
a(lambda(x),y) |
→ lambda(a(x,1)) |
| 2: |
|
a(lambda(x),y) |
→ lambda(a(x,a(y,t))) |
| 3: |
|
a(a(x,y),z) |
→ a(x,a(y,z)) |
| 4: |
|
lambda(x) |
→ x |
| 5: |
|
a(x,y) |
→ x |
| 6: |
|
a(x,y) |
→ y |
|
There are 7 dependency pairs:
|
| 7: |
|
A(lambda(x),y) |
→ LAMBDA(a(x,1)) |
| 8: |
|
A(lambda(x),y) |
→ A(x,1) |
| 9: |
|
A(lambda(x),y) |
→ LAMBDA(a(x,a(y,t))) |
| 10: |
|
A(lambda(x),y) |
→ A(x,a(y,t)) |
| 11: |
|
A(lambda(x),y) |
→ A(y,t) |
| 12: |
|
A(a(x,y),z) |
→ A(x,a(y,z)) |
| 13: |
|
A(a(x,y),z) |
→ A(y,z) |
|
The approximated dependency graph contains one SCC:
{8,10-13}.
-
Consider the SCC {8,10-13}.
The constraints could not be solved.
Tyrolean Termination Tool (0.02 seconds)
--- May 3, 2006